Dimensioning and on-line scheduling in Lambda Grids using divisible load concepts

Scalable dimensioning of resilient Lambda Grids

Grids consist of the aggregation of numerous dispersed computational, storage and network resources, able to satisfy even the most demanding computing jobs. Due to the data-intensive nature of Grid jobs, there is an increasing interest in Grids using optical transport networks as this technology allows for the timely delivery of large amounts of data. Such Grids are commonly referred to as Lamb...

Divisible Load Scheduling and Markov Chain Models

In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. This provides a basic unification of both data parallel divisible load scheduling and Markov chain models for the first time in 16 years of research. Such equivalence is demonstrated for divisible scheduling on linear daisy chains and single and two level tree netw...

Divisible Load Scheduling in Distributed Computing Environments

When attempting to achieve a time-consuming computation it is often advantageous to split the computation amongst multiple machines. Splitting a computation leads to the question of how to divide the load amongst the machines. If we assume that the load can be arbitrarily split and that there are no precedence relations amongst pieces of the load, we call the load divisible. One example of a di...

The Combinatorics in Divisible Load Scheduling

Priority-based Divisible Load Scheduling using Analytical Hierarchy Process

The divisible load scheduling is a paradigm in the area of distributed computing. The traditional divisible load theory is based on the fact that, the communications and computations are obedient and do not cheat the algorithm. The literature of review shows that the divisible load model fail to achieve its optimal performance, if the processors do not report their true computation rates. The d...